Quantum Linearization Attacks
نویسندگان
چکیده
Recent works have shown that quantum period-finding can be used to break many popular constructions (some block ciphers such as Even-Mansour, multiple MACs and AEs...) in the superposition query model. So far, all broken exhibited a strong algebraic structure, which enables craft periodic function of single input block. Recovering secret period allows recover key, distinguish, confidentiality or authenticity these modes.In this paper, we introduce linearization attack, new way using Simon’s algorithm target Specifically, use inputs blocks an interface hiding linear structure. structure perform forgeries.We also present some variants attack other algorithms, are much less common symmetric cryptanalysis: Deutsch’s, Bernstein-Vazirani’s, Shor’s. To best our knowledge, is first time algorithms been forgery key-recovery attacks.Our breaks parallelizable LightMac, PMAC, numerous with (classical) beyond-birthday-bound security (LightMAC+, PMAC+) tweakable (ZMAC). More generally, it shows constructing quantum-secure PRFs might challenging task.
منابع مشابه
Linearization Attacks Against Syndrome Based Hashes
In MyCrypt 2005, Augot, Finiasz, and Sendrier proposed FSB, a family of cryptographic hash functions. The security claim of the FSB hashes is based on a coding theory problem with hard average-case complexity. In the ECRYPT 2007 Hash Function Workshop, new versions with essentially the same compression function but radically different security parameters and an additional final transformation w...
متن کاملAn Improvement of Linearization-Based Algebraic Attacks
In an algebraic attack on a cipher, one expresses the encryption function as a system (usually overdefined) of multivariate polynomial equations in the bits of the plaintext, the ciphertext and the key, and subsequently solves the system for the unknown key bits from the knowledge of one or more plaintext/ciphertext pairs. The standard eXtended Linearization algorithm (XL) expands the initial s...
متن کاملLinearization Framework for Collision Attacks: Application to CubeHash and MD6
In this paper, an improved differential cryptanalysis framework for finding collisions in hash functions is provided. Its principle is based on linearization of compression functions in order to find low weight differential characteristics as initiated by Chabaud and Joux. This is formalized and refined however in several ways: for the problem of finding a conforming message pair whose differen...
متن کاملImprovements of Linearization-based Algebraic Attacks on Block Ciphers
Algebraic attacks are studied as a potential cryptanalytic procedure for several cryptographic primitives. In an algebraic attack on a cipher, one expresses the encryption function as a system (usually overdefined) of multivariate polynomial equations in the bits of the plaintext, the ciphertext and the key, and subsequently solves the system for the unknown key bits from the knowledge of one o...
متن کاملOn quantum preimage attacks
We propose a preimage attack against cryptographic hash functions based on the speedup enabled by quantum computing. Preimage resistance is a fundamental property cryptographic hash functions must possess. The motivation behind this work relies in the lack of conventional attacks against newly introduced hash schemes such as the recently elected SHA-3 standard. The proposed algorithm consists o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-92062-3_15